- Helly theorem
- теорема f Хелли
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
Helly's theorem — In geometry, Helly s theorem is a basic combinatorial result on convex sets. It was proved by Eduard Helly in 1923, and gave rise to the notion of Helly family.tatement of Helly s theorem:Suppose that::X 1,X 2,dots,X n :is a finite collection of… … Wikipedia
Helly's selection theorem — In mathematics, Helly s selection theorem states that a sequence of functions that is locally of bounded total variation and uniformly bounded at a point has a convergent subsequence. In other words, it is a compactness theorem for the space… … Wikipedia
Helly family — In combinatorics, a Helly family of order k is a family of sets such that any minimal subfamily with an empty intersection has k or fewer sets in it. In other words, any subfamily such that every (k+1) fold intersection is non empty has non empty … Wikipedia
Helly–Bray theorem — In probability theory, the Helly–Bray theorem relates the weak convergence of cumulative distribution functions to the convergence of expectations of certain measurable functions. The first eponym is Eduard Helly. Let F and F 1, F 2, ... be… … Wikipedia
Fraňková-Helly selection theorem — In mathematics, the Fraňková Helly selection theorem is a generalisation of Helly s selection theorem for functions of bounded variation to the case of regulated functions. It was proved in 1991 by the Czech mathematician Dana… … Wikipedia
Eduard Helly — (1884, Vienna – 1943, Chicago) was a mathematician and the eponym of Helly s theorem, Helly families, Helly s selection theorem, Helly metric, and the Helly Bray theorem.External links* … Wikipedia
Radon's theorem — In geometry, Radon s theorem on convex sets, named after Johann Radon, states that any set of d+2 points in R d can be partitioned into two (disjoint) sets whose convex hulls intersect. A point in the intersection of these hulls is called a Radon … Wikipedia
Eduard Helly — (* 1. Juni 1884 in Wien; † 28. November 1943 in Chicago, Illinois) war ein österreichischer Mathematiker. Inhaltsverzeichnis 1 Leben 2 Einzelnachweise 3 Literatur … Deutsch Wikipedia
Arzelà–Ascoli theorem — In mathematics, the Arzelà–Ascoli theorem of functional analysis gives necessary and sufficient conditions to decide whether every subsequence of a given sequence of real valued continuous functions defined on a closed and bounded interval has a… … Wikipedia
Prokhorov's theorem — In mathematics, Prokhorov s theorem is a theorem of measure theory that relates tightness of measures to weak compactness (and hence weak convergence) in the space of probability measures. It is credited to the Soviet mathematician Yuri… … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium